Problem set

Results: 1590



#Item
21New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc

New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc

Add to Reading List

Source URL: barbierm01.users.greyc.fr

Language: English - Date: 2012-09-14 10:31:23
    221 CS229 Problem Set #1 CS 229, Fall 2017 Problem Set #1: Supervised Learning

    1 CS229 Problem Set #1 CS 229, Fall 2017 Problem Set #1: Supervised Learning

    Add to Reading List

    Source URL: cs229.stanford.edu

    Language: English - Date: 2017-10-07 20:42:50
      23Problem Set 1 Due Tuesday, SeptFind two distinct bases for Q3 . 2. There are 3 bases for F22 . Find them. 3. Let K and L be fields with K a subfield of L (so it is a subset and the multiplication, etc are those co

      Problem Set 1 Due Tuesday, SeptFind two distinct bases for Q3 . 2. There are 3 bases for F22 . Find them. 3. Let K and L be fields with K a subfield of L (so it is a subset and the multiplication, etc are those co

      Add to Reading List

      Source URL: people.virginia.edu

      Language: English - Date: 2007-09-06 12:45:23
        24EEB 581, Problem Set Ten Solutions Consider the following 25 data points (to save retyping, this list is also on the website as a text link

        EEB 581, Problem Set Ten Solutions Consider the following 25 data points (to save retyping, this list is also on the website as a text link

        Add to Reading List

        Source URL: nitro.biosci.arizona.edu

        Language: English - Date: 2006-04-21 12:38:36
          25SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

          SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

          Add to Reading List

          Source URL: homepages.cwi.nl

          Language: English - Date: 2010-02-06 15:22:54
            26Problem set 2 Filip Rozsypal November 23, 2011 Exercise 1 In problem set 1, Question 4, you were supposed to contrast effects of permanent and temporary

            Problem set 2 Filip Rozsypal November 23, 2011 Exercise 1 In problem set 1, Question 4, you were supposed to contrast effects of permanent and temporary

            Add to Reading List

            Source URL: filip-rozsypal.github.io

            Language: English - Date: 2018-07-13 05:36:29
              27NATIONAL ACCOUNTS AT CONSTANT PRICES BY J. B. BRODERICK Central Statistics Office, Dublin This article discusses the problem of compiling a balanced set of national accounts at

              NATIONAL ACCOUNTS AT CONSTANT PRICES BY J. B. BRODERICK Central Statistics Office, Dublin This article discusses the problem of compiling a balanced set of national accounts at

              Add to Reading List

              Source URL: www.roiw.org

              Language: English - Date: 2004-01-29 23:47:56
                28Political Instability Task Force (PITF) Consolidated Problem Set, Historical State Armed Conflicts and Regime Crises, Country Afghanistan Type of Conflict

                Political Instability Task Force (PITF) Consolidated Problem Set, Historical State Armed Conflicts and Regime Crises, Country Afghanistan Type of Conflict

                Add to Reading List

                Source URL: www.systemicpeace.org

                Language: English - Date: 2017-08-07 22:32:03
                  29Interval Deletion is Fixed-Parameter Tractable∗ Yixin Cao† Abstract We study the minimum interval deletion problem, which asks for the removal of a set of at most k vertices to make a graph on n vertices into an inte

                  Interval Deletion is Fixed-Parameter Tractable∗ Yixin Cao† Abstract We study the minimum interval deletion problem, which asks for the removal of a set of at most k vertices to make a graph on n vertices into an inte

                  Add to Reading List

                  Source URL: www.cs.bme.hu

                  Language: English - Date: 2014-01-28 15:51:10
                    30Celestial Mechanics Problem Set 2: The State Transition Matrix and Method of Differential Corrections J.D. Mireles James December 11, 2006

                    Celestial Mechanics Problem Set 2: The State Transition Matrix and Method of Differential Corrections J.D. Mireles James December 11, 2006

                    Add to Reading List

                    Source URL: cosweb1.fau.edu

                    Language: English - Date: 2014-09-03 14:53:56